#include<bits/tsdc++.h>
using namespace std;
typedef long long ll;
int main(){
    freopen("arena.in","r",stdin);
    freopen("arena.out","w",stdout);
    return 0;
}
/*dijkstra
struct node{
bool operator < (const node &b) const{
    return val<b.val;
}
}
priority_queue<>Q;
    Q.push(st)
    dis[st]=0
    while(!Q.empty){
        `if(vis[u]==1) continue;
        vis[u]=1
        t=q.top(),q.pop()
        for(v that t.num can reach){
            get edge
            if(dis[v]>dis[u]+edge.w){
                shrink
                Q.push(v)
            }
        }
    }
